Giant component in random multipartite graphs with given degree sequences
نویسندگان
چکیده
منابع مشابه
Quasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of necessity possess them all. These properties, termed quasirandom, have been described for a variety of structures such as graphs, hypergraphs, tournaments, Boolean functions, and subsets of Zn, and most recently, sparse gra...
متن کاملInduced subgraphs in sparse random graphs with given degree sequences
Let Gn,d denote the uniformly random d-regular graph on n vertices. For any S ⊂ [n], we obtain estimates of the probability that the subgraph of Gn,d induced by S is a given graph H. The estimate gives an asymptotic formula for any d = o(n1/3), provided that H does not contain almost all the edges of the random graph. The result is further extended to the probability space of random graphs with...
متن کاملConnected components in random graphs with given expected degree sequences
We consider a family of random graphs with a given expected degree sequence. Each edge is chosen independently with probability proportional to the product of the expected degrees of its endpoints. We examine the distribution of the sizes/volumes of the connected components which turns out depending primarily on the average degree d and the secondorder average degree d̃. Here d̃ denotes the weigh...
متن کاملEmergence and size of the giant component in clustered random graphs with a given degree distribution.
Standard techniques for analyzing network models usually break down in the presence of clustering. Here we introduce a new analytic tool, the "free-excess degree" distribution, which extends the generating function framework, making it applicable for clustered networks (C>0). The methodology is general and provides a new expression for the threshold point at which the giant component emerges an...
متن کاملSigned degree sequences in signed multipartite graphs
A signed k-partite graph (signed multipartite graph) is a k-partite graph in which each edge is assigned a positive or a negative sign. If G(V1, V2, · · · , Vk) is a signed k-partite graph with Vi = {vi1, vi2, · · · , vini}, 1 ≤ i ≤ k, the signed degree of vij is sdeg(vij) = dij = d + ij − d − ij , where 1 ≤ i ≤ k, 1 ≤ j ≤ ni and d + ij(d − ij) is the number of positive (negative) edges inciden...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Systems
سال: 2015
ISSN: 1946-5238
DOI: 10.1214/13-ssy135